Monte Carlo Sampling-Based Methods for Stochastic Optimization

نویسندگان

  • Tito Homem-de-Mello
  • Adolfo Ibañez
  • Güzin Bayraksan
چکیده

This paper surveys the use of Monte Carlo sampling-based methods for stochastic optimization problems. Such methods are required when—as it often happens in practice—the model involves quantities such as expectations and probabilities that cannot be evaluated exactly. While estimation procedures via sampling are well studied in statistics, the use of such methods in an optimization context creates new challenges such as ensuring convergence of optimal solutions and optimal values, testing optimality conditions, choosing appropriate sample sizes to balance the effort between optimization and estimation, and many other issues. Much work has been done in the literature to address these questions. The purpose of this paper is to give an overview of some of that work, with the goal of introducing the topic to students and researchers and providing a practical guide for someone who needs to solve a stochastic optimization problem with sampling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-monte Carlo Strategies for Stochastic Optimization

In this paper we discuss the issue of solving stochastic optimization problems using sampling methods. Numerical results have shown that using variance reduction techniques from statistics can result in significant improvements over Monte Carlo sampling in terms of the number of samples needed for convergence of the optimal objective value and optimal solution to a stochastic optimization probl...

متن کامل

Adaptive Sample Size and Importance Sampling in Estimation-based Local Search for Stochastic Combinatorial Optimization: A complete analysis

Metaheuristics and local search algorithms have received considerable attention as promising methods for tackling stochastic combinatorial optimization problems. However, in stochastic settings, these algorithms are usually simple extensions of the versions that are originally designed for deterministic optimization and often they lack rigorous integration with techniques that handle the stocha...

متن کامل

Nonlinear Stochastic Optimization by the Monte-Carlo Method

Methods for solving stochastic optimization problems by Monte-Carlo simulation are considered. The stoping and accuracy of the solutions is treated in a statistical manner, testing the hypothesis of optimality according to statistical criteria. A rule for adjusting the Monte-Carlo sample size is introduced to ensure the convergence and to find the solution of the stochastic optimization problem...

متن کامل

An Ordinal-Optimization-based Approach to Stochastic Mixed Integer Nonlinear Programming

The methods to solve the stochastic MINLP problems fall into two categories: numerical integration method and sample average method. The numerical integration method utilizes numerical integration techniques to calculate the multi-dimensional integrals, such as the Gaussian Quadratures/Cubatures method. The Monte Carlo simulation is one of the most widely used sample average methods. Acevedo an...

متن کامل

On Rates of Convergence for Stochastic Optimization Problems Under Non--Independent and Identically Distributed Sampling

In this paper we discuss the issue of solving stochastic optimization problems by means of sample average approximations. Our focus is on rates of convergence of estimators of optimal solutions and optimal values with respect to the sample size. This is a well-studied problem in case the samples are independent and identically distributed (i.e., when standard Monte Carlo simulation is used); he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014